Description: We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm.-We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm. Platform: |
Size: 578560 |
Author:杨松 |
Hits:
Description: 关于城市输油管道的博弈论分析，采用纳什均衡等博弈理论进行分析-Game theory on urban pipeline analysis, using game theory Nash equilibrium were analyzed Platform: |
Size: 1247232 |
Author:Duan Anqi |
Hits:
Description: 基于博弈论的无线电频谱分配MATLAB程序，运用了纳什均衡-Based on the game theory of radio spectrum allocation MATLAB program, the use of Nash equilibrium Platform: |
Size: 4096 |
Author:*** |
Hits:
Description: 功率优化 注水算法，功率优化，MIMO使用。包含mutual_mimo_func_diag等文件。(The function water fall solves prower control to compute one sample. It uses an optimization formulation of n-person non-co-operative games as described in the adjoining paper "An Optimization Formulation to Compute Nash Equilibrium in finite Games")) Platform: |
Size: 2048 |
Author:江湖
|
Hits:
Description: 利用博弈论对无线网络的功率控制问题进行分析，源码能迭代实现纳什均衡，迭代过程以图形展示。(The game theory is used to analyze the power control of wireless networks, and the source code can realize the Nash equilibrium iteratively, and the iterative process is shown graphically.) Platform: |
Size: 3072 |
Author:siyue
|
Hits:
Description: 应用matlab，对功率运用博弈论的算法，实现功率的纳什均衡，能够运行。里面介绍了效用函数的运用。(Application of matlab, the use of game theory of power algorithm to achieve power Nash equilibrium, able to run. Which describes the use of utility functions.) Platform: |
Size: 27648 |
Author:1yan
|
Hits:
Description: 电池与SC的混合储能的容量配置的非合作博弈算法，寻找Nash均衡解(Non-cooperative game algorithm for capacity allocation of battery and SC hybrid energy storage, looking for Nash equilibrium solution) Platform: |
Size: 14515200 |
Author:安猋 |
Hits:
Description: n 人有限非合作博弈计算一个纳什均衡 N human finite non cooperative game for computing a Nash equilibrium(N human finite non cooperative game for computing a Nash equilibrium) Platform: |
Size: 96256 |
Author:nicolasTU |
Hits:
Description: 运用博弈论，进行机器人避障避障，若多机器人之间存在动态碰撞，利用博弈论构建多机器人之间的动态避障模型，并利用虚拟行动法来解决博弈的求解问题及多Nash 均衡的选择问题，确保每
个机器人 能够快速学习到最优Nash 均衡(robot avoiding if there are dynamic collisions between multi-agents, the game theory is used to construct a dynamic obstacle avoidance model between multi-agents, and the virtual action method is used to solve the problem of solving the game and the selection of multiple Nash equilibriums to ensure that each agent can quickly learn the optimal Nash equilibrium.) Platform: |
Size: 1024 |
Author:小脸怪 |
Hits:
Search - Nash equilibrium